Loopy Belief Propagation for Bipartite Maximum Weight b-Matching
نویسندگان
چکیده
We formulate the weighted b-matching objective function as a probability distribution function and prove that belief propagation (BP) on its graphical model converges to the optimum. Standard BP on our graphical model cannot be computed in polynomial time, but we introduce an algebraic method to circumvent the combinatorial message updates. Empirically, the resulting algorithm is on average faster than popular combinatorial implementations, while still scaling at the same asymptotic rate of O(bn). Furthermore, the algorithm shows promising performance in machine learning applications.
منابع مشابه
Loopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
Abstract—For the minimum cardinality vertex cover and maximum cardinality matching problems, the max-product form of belief propagation (BP) is known to perform poorly on general graphs. In this paper, we present an iterative annealing BP algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover problem on general graphs. As a consequence, our anneali...
متن کاملApproximating the Permanent with Belief Propagation
This work describes a method of approximating matrix permanents efficiently using belief propagation. We formulate a probability distribution whose partition function is exactly the permanent, then use Bethe free energy to approximate this partition function. After deriving some speedups to standard belief propagation, the resulting algorithm requires O(n) time per iteration and seems empirical...
متن کاملMaximum Likelihood Graph Structure Estimation with Degree Distributions
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. This binary graph structure is obtained by reformulating the inference problem as a generalization of the polynomial time combinatorial optimization problem known as b-matching, which recovers a degree constrained maxim...
متن کاملFast b-matching via Sufficient Selection Belief Propagation
This article describes scalability enhancements to a previously established belief propagation algorithm that solves bipartite maximum weight b-matching. The previous algorithm required O(|V | + |E|) space and O(|V ||E|) time, whereas we apply improvements to reduce the space to O(|V |) and the time to O(|V |2.5) in the expected case (though worst case time is still O(|V ||E|)). The space impro...
متن کاملCorrectness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
Graphical models, such as Bayesian networks and Markov random elds represent statistical dependencies of variables by a graph. Local \belief propagation" rules of the sort proposed by Pearl [20] are guaranteed to converge to the correct posterior probabilities in singly connected graphs. Recently good performance has been obtained by using these same rules on graphs with loops, a method known a...
متن کامل